Large Candidate Branch-based Method for Mining Concurrent Branch Patterns
نویسندگان
چکیده
This paper presents a novel data mining technique, known as Post Sequential Patterns Mining. The technique can be used to discover structural patterns that are composed of sequential patterns, branch patterns or iterative patterns. The concurrent branch pattern is one of the main forms of structural patterns and plays an important role in event-based data modelling. To discover concurrent branch patterns efficiently, a concurrent group is defined and this is used roughly to discover candidate branch patterns. Our technique accomplishes this by using an algorithm to determine concurrent branch patterns given a customer database. The computation of the support for such patterns is also discussed.
منابع مشابه
Mining Positive and Negative Association Rules from Multi Database in Distributed Environment
Data mining techniques can be used to extract meaningful1 patterns from large databases for decision making. When the organizations has maintain multiple databases for different branches, traditional ARM techniques are not sufficient to find global patterns which are from local patterns of branch databases. In this paper, a multi database mining model is proposed to find interested global posit...
متن کاملMining Top-k Approximate Frequent Patterns
Frequent pattern (itemset) mining in transactional databases is one of the most well-studied problems in data mining. One obstacle that limits the practical usage of frequent pattern mining is the extremely large number of patterns generated. Such a large size of the output collection makes it difficult for users to understand and use in practice. Even restricting the output to the border of th...
متن کاملEfficient single-pass frequent pattern mining using a prefix-tree
The FP-growth algorithm using the FP-tree has been widely studied for frequent pattern mining because it can dramatically improve performance compared to the candidate generation-and-test paradigm of Apriori. However, it still requires two database scans, which are not consistent with efficient data stream processing. In this paper, we present a novel tree structure, called CP-tree (compact pat...
متن کاملPrediction and Diagnosis of Diabetes Mellitus using a Water Wave Optimization Algorithm
Data mining is an appropriate way to discover information and hidden patterns in large amounts of data, where the hidden patterns cannot be easily discovered in normal ways. One of the most interesting applications of data mining is the discovery of diseases and disease patterns through investigating patients' records. Early diagnosis of diabetes can reduce the effects of this devastating disea...
متن کاملSingle-pass incremental and interactive mining for weighted frequent patterns
Weighted frequent pattern (WFP) mining is more practical than frequent pattern mining because it can consider different semantic significance (weight) of the items. For this reason, WFP mining becomes an important research issue in data mining and knowledge discovery. However, existing algorithms cannot be applied for incremental and interactive WFP mining and also for stream data mining becaus...
متن کامل